A new algorithm for computing SAGBI bases up to an arbitrary degree

A new algorithm for computing Groebner bases

Buchberger’s algorithm for computing Gröbner bases was introduced in 1965, and subsequently there have been extensive efforts in improving its efficiency. Major algorithms include F4 (Faugère 1999), XL (Courtois et al. 2000) and F5 (Faugère 2002). F5 is believed to be the fastest algorithm known in the literature. Most recently, Gao, Guan and Volny (2010) introduced an incremental algorithm (G2...

a new approach to credibility premium for zero-inflated poisson models for panel data

هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...

An algorithm for computing invariants of linear actions of algebraic groups up to a given degree

We propose an algorithm for computing invariant rings of algebraic groups which act linearly on affine space, provided that degree bounds for the generators are known. The groups need not be finite nor reductive, in particular, the algorithm does not use a Reynolds operator. If an invariant ring is not finitely generated the algorithm can be used to compute invariants up to a given degree.

SAGBI Bases Under Composition

Our interest in the subject of this paper is inspired by Hong (1998), where Hoon Hong addresses the problem of the behavior of Gröbner bases under composition of polynomials. More precisely, let Θ be a set of polynomials, as many as the variables in our polynomial ring. The question then is under which conditions on these polynomials it is true that for an arbitrary Gröbner basis G (with respec...

SAGBI and SAGBI-Gröbner Bases over Principal Ideal Domains

A New Arbitrary Starting Simplicial Algorithm for Computing an Integer Point of an n-Dimensional Simplex∗

Determining whether there is an integer point in an n-dimensional simplex is an NPcomplete problem. In this paper, a new arbitrary starting variable dimension algorithm is developed for computing an integer point of an n-dimensional simplex. The algorithm is derived from an introduction of an integer labeling rule and an application of a triangulation of the space and is composed of two phases,...